A line element algorithm for curve flow problems in the plane

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Line Element Algorithm for Curve Flow Problems in the Plane

In this paper we will describe a numerical method for the solution of curve ow problems in which the normal velocity of the curve depends locally on the position, normal and curvature of the curve. The method involves approximating the curve by a number of line elements (segments) which are only allowed to move in a direction normal to the element. Hence the normal of each line element remains ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Solving railway line planning problems using a decomposition algorithm

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....

متن کامل

Dewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems

We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.

متن کامل

Ergodicity of Stochastic Curve Shortening Flow in the Plane

We study models of the motion by mean curvature of an (1+1) dimensional interface with random forcing. For the well-posedness of the models we prove existence and uniqueness for certain degenerate nonlinear stochastic evolution equations in the variational framework of Krylov-Rozovskĭı, replacing the standard coercivity assumption by a Lyapunov type condition. Ergodicity is established for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics

سال: 1993

ISSN: 0334-2700,1839-4078

DOI: 10.1017/s0334270000009152